Fundamental As Fewer Bits
نویسندگان
چکیده
منابع مشابه
Doing More with Fewer Bits
We present a variant of the Diffie-Hellman scheme in which the number of bits exchanged is one third of what is used in the classical Diffie-Hellman scheme, while the offered security against attacks known today is the same. We also give applications for this variant and conjecture a extension of this variant further reducing the size of sent information.
متن کاملCoding Floorplans with Fewer Bits
In this paper we consider the problem of encoding a given floorplan R into a binary string S so that S can be decoded to reconstruct R. Furthermore we wish to minimize the length of S . Succinct representation of graphs are studied for many classes of graphs [14], for instance, trees [8], [15] and plane graphs [2], [3], [6], [11]. The well known naive coding of ordered trees is as follows. Give...
متن کاملPrimality Testing with Fewer Random Bits 1
In the usual formulations of the Miller-Rabin and Solovay-Strassen primality testing algorithms, to test a number n for primality, the algorithm chooses \candidates" x 1 ; x 2 ; : : :; x k uniformly and independently at random from Z n , and tests if any are a \witness" to the compositeness of n. For either algorithm, the probability that it errs is at most 2 ?k. In this paper, we study the err...
متن کاملFactoring Polynomials Using Fewer Random Bits
Let F be a eld of q = p n elements, where p is prime. We present two new probabilistic algorithms for factoring polynomials in FX] that make particularly eecient use of random bits. They are easy to implement, and require no randomness beyond an initial seed whose length is proportional to the input size. The rst algorithm is based on a procedure of Berlekamp; on input f in FX] of degree d, it ...
متن کاملApproximate Randomization of Quantum States With Fewer Bits of Key
Randomization of quantum states is the quantum analogue of the classical one-time pad. We present an improved, efficient construction of an approximately randomizing map that uses O(d/ ) Pauli operators to map any d-dimensional state to a state that is within trace distance of the completely mixed state. Our bound is a log d factor smaller than that of Hayden, Leung, Shor, and Winter [7], and A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Terry's Archive Online
سال: 2021
ISSN: 2694-4596
DOI: 10.48034/20180122